Geometry Helps to Compare Persistence Diagrams
نویسندگان
چکیده
منابع مشابه
Using Diagrams to Understand Geometry
This paper describes ARCHIMEDES-STUDENT, a computer program that constructs and modifies its own representations of diagrams from instructions supplied by a human who is demonstrating a theorem of geometry. The program’s representation permits it to make inferences from its constructions and to find a justification for the conclusion of the theorem. It is argued that the sort of perceptual reas...
متن کاملConfidence Sets for Persistence Diagrams
Persistent homology is a method for probing topological properties of point clouds and functions. The method involves tracking the birth and death of topological features as one varies a tuning parameter. Features with short lifetimes are informally considered to be “topological noise,” and those with a long lifetime are considered to be “topological signal.” In this paper, we bring some statis...
متن کاملThree Approaches to Automated Topology, and How Computational Geometry Helps
Traditional polygon-arc-node topology is standard in vector GIS, but it has its limitations. This is particularly evident at the digitizing stage, which often appears excessively complex and tedious, Other methods, however, are capable of maintaining some forms of topology “automatically”, and this paper is an overview of three approaches based on the Voronoi diagram (or the equivalent Delaunay...
متن کاملPersistence Diagrams as Diagrams: A Categorification of the Stability Theorem
Persistent homology, a central tool of topological data analysis, provides invariants of data called barcodes (also known as persistence diagrams). A barcode is simply a multiset of real intervals. Recent work of Edelsbrunner, Jabłoński, and Mrozek suggests an equivalent description of barcodes as functors R → Mch, where R is the poset category of real numbers and Mch is the category whose obje...
متن کاملFréchet Means for Distributions of Persistence Diagrams
Given a distribution ρ on persistence diagrams and observations X1, ...Xn iid ∼ ρ we introduce an algorithm in this paper that estimates a Fréchet mean from the set of diagrams X1, ...Xn. If the underlying measure ρ is a combination of Dirac masses ρ = 1 m ∑m i=1 δZi then we prove the algorithm converges to a local minimum and a law of large numbers result for a Fréchet mean computed by the alg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Journal of Experimental Algorithmics
سال: 2017
ISSN: 1084-6654,1084-6654
DOI: 10.1145/3064175